منابع مشابه
Bounds on FSM Switching Activity
This paper obtains lower and upper bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. More specifically, the paper bounds the average Hamming distance which is in turn proportional to the switching activity and the overall power dissipation of the system. By introducing the concepts of a distance matrix and a weight ...
متن کاملUpper and lower bounds on FSM switching activity
This paper obtains upper and lower bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. By exploiting the symmetries between the Hamming distances of state encodings, we obtain tight bounds on the average Hamming distance, which is proportional to the average switching activity and the overall power dissipation of the ...
متن کاملA Strategy for Low Power FSM-Design by Reducing Switching Activity
Power dissipation is growing to be one of the most crucial parameter in the design of VLSI systems. Focusing the low power design of synchronous finite state machines (FSM) our paper presents a novel approach to reduce switching events by a profiling-based strategy. The idea of this strategy is to combine the deactivation of special self-loops with an appropriate state assignment. Analyzing the...
متن کاملComputation of lower bounds for switching activity using decision theory
Accurate switching activity estimation is crucial for power budgeting. It is impractical to obtain an accurate estimate by simulating the circuit for all possible inputs. An alternate approach would be to compute tight bounds for the switching activity. In this paper, we propose a non-simulative decision theoretic method to compute the lower bound for switching activity. First, we show that the...
متن کاملOn FSM-Based Fault Diagnosis
We study the problem of fault diagnosis, i.e., localization of difference(s) between an implementation and a specification in systems modelled by finite state machines. We show that even considering only a single fault in a finite state machine there are some situations when the exact diagnosis of the fault cannot be assured. We give an algorithm for fault diagnosis. If it is possible the proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal Processing Systems
سال: 2008
ISSN: 1939-8018,1939-8115
DOI: 10.1007/s11265-008-0245-z